package First;

public class InsertSort {
    public void InsertSort(int[]L,int length){
        int i=1,j,temp;
        while(i<length){
            j=i;
            temp=L[j];
            if(temp<L[j-1]&&j!=0){
                L[j]=L[j-1];
                j--;
            }
            L[j]=temp;
            i++;
        }

    }
}
